On relations among some constants of an entire function
نویسندگان
چکیده
منابع مشابه
On Relations among Some Constants of an Entire Function
If Piz) is an entire function of order p, it is known that (1) M, m are its type and co-type, in case/ happens to be the rank (or position) function of the maximum term of the Maclaurin series of P (see Chapter II of [l] and Chapter II of [2]) and that (2) M and m are the logarithmic type and co-type of P, if fix) is the number of zeroes z of Piz) such that \z\ ^x (see Jensen's Theorem, Chapter...
متن کاملan examination of developmental dyslexia among iranian efl second graders
چکیده رساله/پایان نامه: این تحقیق جهت بررسی تاثیر نارسا خوانی در یادگیری زبان انگلیسی به عنوان زبان خارجه در میان دانش اموزان ایرانی مقطع دوم راهنمایی طراحی شده است. ده نفر از دانش اموزان ایرانی مقطع دوم راهنمایی و ده نفر از دانش اموزان غیر نارسا خوان همان مقطع برای انجام این تحقیق انتخاب شدند. تمام شرکت کنندگان توسط ازمون زبان انگلیسی ای که برای این هدف ساخته شده و متشکل از بخشهای خواندن ام...
15 صفحه اولRelations among Some Conjectures on the Möbius Function and the Riemann Zeta-function
Abstract. We discuss the multiplicity of the non-trivial zeros of the Riemann zetafunction and the summatory function M(x) of the Möbius function. The purpose of this paper is to consider two open problems under some conjectures. One is that whether all zeros of the Riemann zeta-function are simple or not. The other problem is that whether M(x) ≪ x holds or not. First, we consider the former pr...
متن کاملRelations among Some Combinatorial Programs
This paper investigates relations among combinatorial optimization problems. To establish such relations we introduce a transformation technique |aggregation| that allows to relax an integer program by means of another integer program. We prove that various families of prominent inequalities for the acyclic subdigraph problem, the multiple knapsack problem, the max cut, graph, and the clique pa...
متن کاملRelations Among Some Combinatorial ProgramsRalf
This paper investigates relations among combinatorial optimization problems. To establish such relations we introduce a transformation technique |aggregation| that allows to relax an integer program by means of another integer program. We prove that various families of prominent inequalities for the acyclic subdigraph problem, the multiple knapsack problem, the max cut, graph, and the clique pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1963
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1963-0148918-9